                              LEGALITIES

                                    
                                     
     We want our  computer programs to be as  widely used as possible,
consequently   unrestricted  use   of  them   within  a   computer  is
permissible.   Use   within  commercial  enterprises   for  commercial
purposes  is   explicitly  allowed  as  is   academic,  research,  and
government or any other use.


      Copies of  any form of the  code (source or  executable) and the
documentation  can be  made  and redistributed  freely.  You may  give
copies  to students, coworkers,  friends, and  enemies. We  do require
that   the  copyright  and   LEGALITIES  section   of  the   code  and
documentation be preserved in such copies.

    Modifications and improvements to the code can similarly be freely
copied and  distributed. Modified  code be clearly  marked as  such so
that we are not requested to fix it. We would appreciate a copy of any
improvements for  incorporation into  later versions of  our programs.
Inclusion of  our code  in software archives  and its  distribution as
freeware  is  encouraged.    

Incorporation  into  Commercial  Packages

Incorporation of our code into  a commercial package that will be sold
requires  written permission  from  an administrative  officer of  the
Department  of Biomathematics.  Our current  policy is  to  grant such
permission  without payment  providing:  

(1) We are  informed of  and approve the  nature of the  product being
developed or prepared for distribution.

(2) Appropriate   acknowledgment  of   our   code  is   made  in   the
documentation  accompanying the product.   This program  contains code
from  the following publications,  and code  from ACM  publications is
subject to the ACM policy (below).
                                     
                                    
                              References

                                     
                                     
                                    
                           Incomplete Beta

                                     
 DiDinato, A. R. and Morris, A. H. (1993) ``Algorithm 708: Significant
 Digit  Computation  of the  Incomplete  Beta  Function Ratios.''  ACM
 Trans.  Math. Softw. 18, 360-373.
                                     
                                    
                          Cumulative Normal

                                     
Cody,  W.D. (1993).  ``ALGORITHM  715: SPECFUN  -  A Portable  FORTRAN
Package  of   Special  Function   Routines  and  Test   Drivers''  ACM
Trans. Math.  Softw. 19, 22-32.
                                     
                                    
                            Inverse Normal

                                     
``Algorithm AS241'' (1988) Appl. Statist. 37, NO. 3, 477-484.
                                     
                                    
                Finding a Zero of a Monotone Function

                                     
Alefeld,  G.  E.,  Potra, F.   A.,  Shi, Y.   (1995) ``Algorithm  748:
Enclosing Zeros  of Continuous Functions.'',  by G. E. Alefeld,  F. A.
Potra, YiXun Shi, ACM Trans. Math. Softw., 21, No. 3, 327-344
                                     
                                    
                     Base Random Number Generator

                                     
P. L'Ecuyer and S. Cote. (1991) ``Implementing a Random Number Package
with  Splitting Facilities.''  ACM  Trans. on  Math.  Softw. 17:1,  pp
98-111.  We transliterated the Pascal of the reference to Fortran 95.
                                     
                                    
                 The Binomial Random Number Generator

                                     
Kachitvichyanukul, V.  and Schmeiser,  B. W. (1988)  ``Binomial Random
Variate Generation.''  Communications of the ACM,  31: 216. (Algorithm
BTPE.)
                                     
                                    
                      ACM Policy on Use of Code

                                     
                 Here is the software Policy of the ACM.
              
              Submittal of an algorithm for publication in one of the
              ACM  Transactions implies that unrestricted use of the
              algorithm within a  computer is permissible. General
              permission to copy and distribute  the algorithm without
              fee is granted provided that the copies are not  made or
              distributed for direct commercial advantage. The ACM 
              copyright notice and the title of the publication and its
              date appear,  and notice is given that copying is by
              permission of the Association  for Computing Machinery. To
              copy otherwise, or to republish, requires  a fee and/or
              specific permission.
              Krogh, F. (1997) ``Algorithms Policy.'' ACM Tran. Math. 
              Softw. 13, 183-186.
                                     
                               NO WARRANTY
                                     
    WE PROVIDE ABSOLUTELY NO WARRANTY  OF ANY KIND EITHER EXPRESSED OR
    IMPLIED, INCLUDING  BUT NOT LIMITED TO, THE  IMPLIED WARRANTIES OF
    MERCHANTABILITY AND  FITNESS FOR A PARTICULAR  PURPOSE. THE ENTIRE
    RISK  AS TO THE  QUALITY AND  PERFORMANCE OF  THE PROGRAM  IS WITH
    YOU. SHOULD THIS  PROGRAM PROVE DEFECTIVE, YOU ASSUME  THE COST OF
    ALL NECESSARY SERVICING, REPAIR  OR CORRECTION.  IN NO EVENT SHALL
    THE  UNIVERSITY OF  TEXAS  OR ANY  OF  ITS COMPONENT  INSTITUTIONS
    INCLUDING M.  D. ANDERSON HOSPITAL  BE LIABLE TO YOU  FOR DAMAGES,
    INCLUDING  ANY  LOST  PROFITS,  LOST  MONIES,  OR  OTHER  SPECIAL,
    INCIDENTAL  OR CONSEQUENTIAL  DAMAGES ARISING  OUT OF  THE  USE OR
    INABILITY TO  USE (INCLUDING  BUT NOT LIMITED  TO LOSS OF  DATA OR
    DATA OR ITS ANALYSIS BEING RENDERED INACCURATE OR LOSSES SUSTAINED
    BY THIRD  PARTIES) THE PROGRAM.  

    (Above NO WARRANTY modified from the GNU NO WARRANTY statement.)
                                     
